Cost Optimal Production-Scheduling Model Based on VNS-NSGA-II Hybrid Algorithm—Study on Tissue Paper Mill

نویسندگان

چکیده

With the development of customization concept, small-batch and multi-variety production will become one major modes, especially for fast-moving consumer goods. However, this mode has two issues: high cost long manufacturing period. To address these issues, study proposes a multi-objective optimization model flexible flow-shop to optimize scheduling, which would maximize efficiency by minimizing makespan. The is designed based on hybrid algorithms, combine fast non-dominated genetic algorithm (NSGA-II) variable neighborhood search (VNS). In model, NSGA-II calculate optimal solutions. VNS improve quality solution obtained NSGA-II. verified an example real-world typical FFS, tissue papermaking mill. results show that scheduling can reduce costs 4.2% makespan 6.8% compared with manual scheduling. VNS-NSGA-II also shows better performance than NSGA-II, both in Hybrid algorithms are good issues

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem

We address the no-wait k-stage flexible flowshop scheduling problem where there are m identical machines at each stage. The objectives are to schedule the available n jobs so that makespan and mean tardiness of n jobs are minimized. Sequence-dependent setup times are treated in this problem as one of the prominent practical assumptions. This problem is NP-hard, and therefore we present a new mu...

متن کامل

Scheduling of a Paper Mill Process Considering Environment and Cost

This study presents a new decision making method for scheduling paper mill processes, especially for the paper converting process. The optimal scheduling is analyzed with the multiobjective optimization programming (MOOP) using the summation of weighed objective functions (SWOF) [Ko and Moon, 2002]. In the production planning for the paper converting mill, making the strategy for the cutting pa...

متن کامل

An Improved Algorithm Based on NSGA-II for Cloud PDTs Scheduling

Partly dependent tasks (PDTs) scheduling with multi-objective optimization in cloud computing is an NP-hard problem. Taking the quality of service (QoS) requirements of users that use cloud computing into account, we set the cost and time requirements of handling the PDTs as the multiple objectives and present an improved algorithm based on the non-dominated sorting genetic algorithm-II (NSGA-I...

متن کامل

Optimal Bespoke CDO Design via NSGA-II

This research work investigates the theoretical foundations and computational aspects of constructing optimal bespoke CDO structures. Due to the evolutionary nature of the CDO design process, stochastic search methods that mimic the metaphor of natural biological evolution are applied. For efficient searching the optimal solution, the nondominating sort genetic algorithm NSGA-II is used, which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Processes

سال: 2022

ISSN: ['2227-9717']

DOI: https://doi.org/10.3390/pr10102072